A Binary Deletion Channel With a Fixed Number of Deletions
نویسنده
چکیده
Suppose a binary string x = x1 . . . xn is being broadcast repeatedly over a faulty communication channel. Each time, the channel delivers a fixed number m of the digits (m < n) with the lost digits chosen uniformly at random, and the order of the surviving digits preserved. How large does m have to be to reconstruct the message?
منابع مشابه
Molecular Study of Partial Deletions of AZFc Region of the Y Chromosome in Infertile Men
Background & Aims: The most significant cause of infertility in men is the genetic deletion in the azoospermia factor (AZF) region that is caused by the process of intra- and inter-chromosomal homologous recombination in amplicons. Homologous recombination could also result in partial deletions in AZF region. The aim of this research was to determine the association between the partial AZFc del...
متن کاملFrom Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them. In a previous work it is conjectured on the basis of experimental data th...
متن کاملSimplification of Packet-symbol Decoding with Deletions, Mis-ordering of Packets, and No Sequence Numbers
A new method is described which builds on Mitzenmacher’s idea of adding a different pseudo-random number to each packet to help in verification-based decoding low density codes with packet deletions or errors, or out-of-order receptions, and no sequence numbers. The new method has less decoding complexity and is applicable to any parity check code structure, not just low density codes. Performa...
متن کاملPerformance Analysis for MIMO System with Deletion Based on Turbo Code
In this work channel is modelled with synchronization errors due to the mismatches between the transmitter and receiver clocks using bit drop-outs (deletions).[3] Each bit is received independently in the binary symmetric channel with error probability P where each bit is erased, Shannon invented the fundamental results through the development as well as analysis of low density parity check cod...
متن کاملCoding against deletions in oblivious and online models
We consider binary error correcting codes when errors are deletions. A basic challenge concerning deletion codes is determining p (adv) 0 , the zero-rate threshold of adversarial deletions, defined to be the supremumof allp for which there exists a code familywith rate bounded away from0 capable of correcting a fraction p of adversarial deletions. A recent construction of deletion-correcting co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2015